Parallelism and Concurrency Theorems for Rules with Nested Application Conditions
نویسندگان
چکیده
We present Local Church-Rosser, Parallelism, and Concurrency Theorems for rules with nested application conditions in the framework of weak adhesive HLR categories including different kinds of graphs. The proofs of the statements are based on the corresponding statements for rules without application conditions and two Shift-Lemmas, saying that nested application conditions can be shifted over morphisms and rules.
منابع مشابه
A Concurrency Control Scheme for Nested Transactions
Locking rules for concurrency control in nested transaction model, in which parent/child parallelism, sibling parallelism, and arbitrary commitment-dependence relationship between transactions are allowed, are presented. The locking rules are based on the lock transformation scheme that never allows the commit deadlock to occur, which could happen by permitting parent/child parallelism. In addi...
متن کاملMulti-Amalgamation in Adhesive Categories
Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations. This concept is especially important for an adequate formalization of the operational semantics of statecharts and other visual modeling languages, where typed attributed graphs are used for multiple rules with general applica...
متن کاملParallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions
The goal of this paper is the generalization of parallelism and concurrency results for adhesive High-Level Replacement (HLR) systems to adhesive HLR systems with negative application conditions. These conditions restrict the application of a rule by expressing that a specific structure should not be present before or after applying the rule to a certain context. Such a condition influences thu...
متن کاملNegative Application Conditions for Reconfigurable Place/Transition Systems
Abstract: This paper introduces negative application conditions for reconfigurable place/transition nets. These are Petri nets together with a set of rules that allow changing the net and its marking dynamically. Negative application conditions are a control structure that prohibits the application of a rule if certain structures are already existent. We motivate the use of negative application...
متن کاملConcurrency control of nested cooperative transactions in active DBMS
Active database management systems(ADBMS) uses Event-Condition-Action rules (ECA rules). Each ECA rule speciies what action to be taken when an event occurs and the speciied condition is satissed. In this paper, we introduce a concurrency control scheme for handling nested cooperative transactions using detached mode ECA rules of an ADBMS. A state transition model has been proposed to specify d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ECEASST
دوره 26 شماره
صفحات -
تاریخ انتشار 2010